Tournament Searching Method to Feature Selection Problem
نویسنده
چکیده
A new search method to the feature selection problem – the tournament searching – is proposed and compared with other popular feature selection methods. The tournament feature selection method is a simple stochastic searching method with only one parameter controlling the global-local searching properties of the algorithm. It is less complicated and easier to use than other stochastic methods, e.g. the simulated annealing or genetic algorithm. The algorithm was tested on several tasks of the feature selection in the supervised learning. For comparison the simulated annealing, genetic algorithm, random search and two deterministic methods were tested as well. The experiments showed the best results for the tournament feature selection method in relation to other tested methods.
منابع مشابه
Tournament Feature Selection with Directed Mutations
A tournament searching method with new mutation operators for a problem of the feature subset selection is presented. The probability of the bit mutation in a classical approach is fixed. In the proposed methods this probability is dependent on the history of the searching process. Bit position whose mutation from 0 to 1 (from 1 to 0) improved the evaluation of the solution in early iterations,...
متن کاملA Parallel Genetic Algorithm Based Method for Feature Subset Selection in Intrusion Detection Systems
Intrusion detection systems are designed to provide security in computer networks, so that if the attacker crosses other security devices, they can detect and prevent the attack process. One of the most essential challenges in designing these systems is the so called curse of dimensionality. Therefore, in order to obtain satisfactory performance in these systems we have to take advantage of app...
متن کاملA Parallel Genetic Algorithm Based Method for Feature Subset Selection in Intrusion Detection Systems
Intrusion detection systems are designed to provide security in computer networks, so that if the attacker crosses other security devices, they can detect and prevent the attack process. One of the most essential challenges in designing these systems is the so called curse of dimensionality. Therefore, in order to obtain satisfactory performance in these systems we have to take advantage of app...
متن کاملTHE UNIVERSITY OF BRITISH COLUMBIA DEPARTMENT OF STATISTICS TECHNICAL REPORT #241 Tournament Screening cum EBIC for Feature Selection with High Dimensional Feature Spaces
The feature selection characterized by relatively small sample size and extremely high dimensional feature space is common in many areas of contemporary statistics. The high dimensionality of the feature space causes serious difficulties: (i) the sample correlations between features become high even if the features are stochastically independent; (ii) the computation becomes intractable. These ...
متن کاملVariable Selection in the Kernel Regression Based Short-Term Load Forecasting Model
The short-term load forecasting is an essential problem in energy system planning and operation. The accuracy of the forecasting models depends on the quality of the input information. The input variable selection allows to chose the most informative inputs which ensure the best forecasts. To improve the short-term load forecasting model based on the kernel regression four variable selection wr...
متن کامل